Constant-Rate Interactive Coding Is Impossible, Even in Constant-Degree Networks
نویسندگان
چکیده
منابع مشابه
Constant-Rate Interactive Coding Is Impossible, Even In Constant-Degree Networks
Multiparty interactive coding allows a network of n parties to perform distributed computations when the communication channels suffer from noise. Previous results (Rajagopalan and Schulman, STOC ’94) obtained a multiparty interactive coding protocol, resilient to random noise, with a blowup of O(log(∆ + 1)) for networks whose topology has a maximal degree ∆. Vitally, the communication model in...
متن کاملP2P Overlay Networks of Constant Degree
This paper proposes an abstract and generic topological model that captures the essence of P2P architecture. Such model should in return facilitate the exploitation of the new design space for more novel P2P systems. The paper also proposes a variant of the cube-connected cycles as a P2P overlay network that achieves O(log N) path length with O(1) neighbors. The simulation result has shown that...
متن کاملTopology Control for Constant Rate Mobile Networks
Controlling the topology of a wireless ad hoc network is very important from the point of view of performance. One known technique for controlling the topology is through the assignment of appropriate transmission power levels to the nodes. Such an assignment aims to minimize a specified function of the powers assigned to nodes. While this problem has been widely studied for the case of station...
متن کاملBuffer−Based Constant Bit−Rate Control for Scalable Video Coding
The emerging Scalable Video Coding (SVC) is an extension of H.264/AVC standard, which shows improved coding efficiency and scalability functionalities with respect to previous scalable video coding approaches. These new functionalities make SVC suitable for meeting the increasing demand for multimedia data and the diversification of network requirements and terminal devices capabilities. To thi...
متن کاملInteractive Oracle Proofs with Constant Rate and Query Complexity
We study interactive oracle proofs (IOPs) [BCS16, RRR16], which combine aspects of probabilistically checkable proofs (PCPs) and interactive proofs (IPs). We present IOP constructions and techniques that let us achieve tradeoffs in proof length versus query complexity that are not known to be achievable via PCPs or IPs alone. Our main results are: 1. Circuit satisfiability has 3-round IOPs with...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2019
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2019.2904576